Quanti er Inference Rules for SMT proofs ∗
نویسندگان
چکیده
This paper discusses advantages and disadvantages of some possible alternatives for inference rules that handle quanti ers in the proof format of the SMT-solver veriT. The quanti erhandling modules in veriT being fairly standard, we hope this will motivate the discussion among the PxTP audience around proof production for quanti er handling. This could generate ideas to help us improve our proof production module, and also bene t the SMT community.
منابع مشابه
Quantifier Inference Rules for SMT proofs
This paper discusses advantages and disadvantages of some possible alternatives for inference rules that handle quantifiers in the proof format of the SMT-solver veriT. The quantifier-handling modules in veriT being fairly standard, we hope this will motivate the discussion among the PxTP audience around proof production for quantifier handling. This could generate ideas to help us improve our ...
متن کاملLFSC for SMT Proofs: Work in Progress
This paper presents work in progress on a new version, for public release, of the Logical Framework with Side Conditions (LFSC), previously proposed as a proof meta-format for SMT solvers and other proof-producing systems. The paper reviews the type-theoretic approach of LFSC, presents a new input syntax which hides the type-theoretic details for better accessibility, and discusses work in prog...
متن کاملEecient Implementation of Non-standard Connectives and Quantiiers in Deductive Reasoning Systems
A rule use information RUI structure has been proposed to implement non standard connectives and quanti ers that generalize conjunction disjunction implication universal quanti er and existential quan ti er The current implementation of the RUI struc ture in the SNePS Inference Package SNIP main tains a single RUI set for each rule which causes a combinatorial number of substitution compatibili...
متن کاملA Machine Learning Technique for Hardness Estimation of QFBV SMT Problems
In this paper, we present a new approach for measuring the expected runtimes (hardness) of SMT problems. The required features, the statistical hardness model used and the machine learning technique which we used are presented. The method is applied to estimate the hardness of problems in the Quanti er Free Bit Vector (QFBV) theory and we used four of the contesting solvers in SMTCOMP2011 to de...
متن کاملScalable Fine-Grained Proofs for Formula Processing
We present a framework for processing formulas in automatic theorem provers, with generation of detailed proofs. The main components are a generic contextual recursion algorithm and an extensible set of inference rules. Clausification, skolemization, theory-specific simplifications, and expansion of ‘let’ expressions are instances of this framework. With suitable data structures, proof generati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011